Case-Bases Incorporating Scheduling Constraint Dimensions - Experiences in Nurse Rostering
نویسندگان
چکیده
This paper looks at work done on a case-based workforce scheduling application. Generalised patterns of workforce allocation are used to build up a schedule that is then adjusted to remove any problems. Because some constraint elements are incorporated in the case-base, the global problem search space is reduced. The case-base can be maintained either automatically, by generalisation of solutions or by theoretical analysis of case efficiency, or manually, by storage of generalised patterns of allocation preference. In line with the background cognitive theory behind case-based reasoning, the methods of arrival at solutions are very similar to the methods used by manual schedulers.
منابع مشابه
A Hyperheuristic Approach to Belgian Nurse Rostering Problems
The nurse rostering problem involves the assignment of shifts to nurses with respect to several constraints like workload, legal restrictions, and contractual agreements [9]. The complexity of the problem attracts many researchers around the world. Since the regulations, requirements, and agreements differ from country to country, the models and solution methods differ as well [9]. The solution...
متن کاملNurse rostering using fuzzy logic: A case study
In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...
متن کاملCase-based reasoning in employee rostering: learning repair strategies from domain experts
The development of methods for solving real world scheduling problems such as employee rostering requires the extensive domain knowledge of manual rostering experts. Rostering problems are subject to numerous conflicting constraints and are difficult to solve. Automated rostering has attracted the attention of the scientific community over the last three decades, however the systematic represen...
متن کاملIncorporating Simplex Method into Guided Complete Search: An Application to the Nurse Rostering Problem
Guided Complete Search (GCS) is a generic framework for combining and coordinating a tree search solver and a secondary solver to yield a complete and efficient CSP solver. The primary solver of GCS is systematic tree search augmented with constraint propagation algorithm, which is used to maintain the completeness of the GCS solver. The secondary solver of GCS can either be a complete or incom...
متن کاملStoring and Adapting Repair Experiences in Employee Rostering
The production of effective workforce rosters is a common management problem. Rostering problems are highly constrained and require extensive experience to solve manually. The decisions made by expert rosterers are often subjective and are difficult to represent systematically. This paper presents a formal description of a new technique for capturing rostering experience using case-based reason...
متن کامل